Orthogonality of matrices
نویسندگان
چکیده
Let A and B be rectangular matrices. Then A is orthogonal to B if II A + f-LB II ?: II A II for every scalar f-L. Some approximation theory and convexity results on matrices are used to study orthogonality of matrices and answer an open problem of Bhatia and Semrl. © 2002 Elsevier Science Inc. All rights reserved.
منابع مشابه
Coordinate-descent for learning orthogonal matrices through Givens rotations
Optimizing over the set of orthogonal matrices is a central component in problems like sparsePCA or tensor decomposition. Unfortunately, such optimization is hard since simple operations on orthogonal matrices easily break orthogonality, and correcting orthogonality usually costs a large amount of computation. Here we propose a framework for optimizing orthogonal matrices, that is the parallel ...
متن کاملOn Approximate Birkhoff-James Orthogonality and Approximate $ast$-orthogonality in $C^ast$-algebras
We offer a new definition of $varepsilon$-orthogonality in normed spaces, and we try to explain some properties of which. Also we introduce some types of $varepsilon$-orthogonality in an arbitrary $C^ast$-algebra $mathcal{A}$, as a Hilbert $C^ast$-module over itself, and investigate some of its properties in such spaces. We state some results relating range-kernel orthogonality in $C^*$-algebras.
متن کاملOrthogonality Matrices for Modulesover Finite Frobenius RingsandMacWilliams’ EquivalenceTheorem
MacWilliams’ equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19–22) where the invertibility of orthogonality matrices of finite vector spaces is the key step. The present paper revisits this technique in orde...
متن کاملEfficient coordinate-descent for orthogonal matrices through Givens rotations
Optimizing over the set of orthogonal matrices is a central component in problems like sparse-PCA or tensor decomposition. Unfortunately, such optimization is hard since simple operations on orthogonal matrices easily break orthogonality, and correcting orthogonality usually costs a large amount of computation. Here we propose a framework for optimizing orthogonal matrices, that is the parallel...
متن کاملMatrices of Varied Orthogonality and Their Codes (Submitted for short presentation at ISIT'98.)
Orthogonal matrices over arbitrary elds are de ned together with their non-square analogs, which are termed row-orthogonal matrices. Antiorthogonal and self-orthogonal square matrices are introduced together with their non-square analogs. The relationships of these matrices to such codes as self-dual codes and linear codes with complementary duals are given.
متن کامل